A note on odd/even cycles
نویسندگان
چکیده
منابع مشابه
A note on short cycles in diagraphs
In 1977, Caccetta and Haggkvist [1] conjectured that if G is a directed graph with n vertices and if each vertex of G has outdegree at least k, then G contains a directed cycle of length at most In~k]. We shall refer to this conjecture as the C H conjecture. Trivially, this conjecture is true for k = 1, and it has been proved for k = 2 (Caccetta and Haggkvist [1]) and k = 3 (Hamildoune [3]). Ch...
متن کاملA Note on Detecting Algebraic Cycles
The purpose of this note is to show that the homologically trivial cycles contructed by Clemens and their generalisations due to Paranjape can be detected by the technique of spreading out. More precisely, we associate to these cycles (and the ambient varieties in which they live) certain families which arise naturally and which are defined over C and show that these cycles, along with their re...
متن کاملNote on alternating directed cycles
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloured graphs (proved to be polynomial time solvable) and the even dicycle problem (the complexity is not known yet). We prove that the alternating dicycle problem is NPcomplete. Let f(n) (g(n), resp.) be the minimum intege...
متن کاملNote on Vertex-Disjoint Cycles
Häggkvist and Scott asked whether one can find a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains vertex-disjoint cycles of k consecutive even lengths. In this paper, it is shown that if G is a graph of average degree at least k + 19k + 12 and sufficiently many vertices, then G contains vertex-disjoint cycles of k consecutive even lengths, answe...
متن کاملA note on short cycles in a hypercube
How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul Erdős about 27 years ago. His conjecture that such a subgraph asymptotically has at most half the edges of a hypercube is still unresolved. Let f(n,Cl) be the largest number of edges in a subgraph of a hypercube Qn containing no cycle of length l. It is known that f(n,Cl) = o(|E(Qn)|), when l ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90125-4